On the Veri cation of Qualitative Properties of Probabilistic
نویسنده
چکیده
We consider sequential and concurrent probabilistic processes and propose a general notion of fairness with respect to probabilistic choice, which allows to express various notions of fairness such as process fairness and event fairness. We show the soundness of proving the validity of qualitative properties of probabilistic processes under fairness constraints in the sense that whenever all fair executions of a probabilistic process fullll a certain linear time property E then E holds for almost all executions (i.e. E holds with probability 1). It follows that in order to verify probabilistic processes w.r.t. linear time speciications, it suuces to establish that { for some instance of our general notion of fairness { all fair executions satisfy the speciication. This generalizes the soundness results for extreme and-fairness established in 25] and 27] respectively. Furthermore, we show that-fairness of 27] is the only fairness notion which is complete for validity of qualitative linear time properties.
منابع مشابه
Formal Veri cation of Performance and Reliability of Real-Time Systems
In this paper we propose a methodology for the speci cation and veri cation of performance and reliability properties of real-time systems within the framework of temporal logic. The methodology is based on the system model of stochastic real-time systems (SRTSs), and on branching-time temporal logics that are extensions of the probabilistic logics pCTL and pCTL*. SRTSs are discrete-time transi...
متن کاملStop-and-Go-MIXes Providing Probabilistic Anonymity in an Open System
Currently known basic anonymity techniques depend on identity veri cation. If veri cation of user identities is not possible due to the related management overhead or a general lack of information (e.g. on the Internet), an adversary can participate several times in a communication relationship and observe the honest users. In this paper we focus on the problem of providing anonymity without id...
متن کاملThe Temporal Specification and . . .
We extend the speci cation language of temporal logic, the corresponding veri cation framework, and the underlying computational model to deal with real-time properties of reactive systems. Semantics We introduce the abstract computational model of timed transition systems as a conservative extension of traditional transition systems: qualitative fairness requirements are superseded by quantita...
متن کاملImproved Probabilistic Veri cation by Hash Compaction
We present and analyze a probabilistic method for veri cation by explicit state enumeration, which improves on the \hashcompact" method of Wolper and Leroy. The hashcompact method maintains a hash table in which compressed values for states instead of full state descriptors are stored. This method saves space but allows a non-zero probability of omitting states during veri cation, which may cau...
متن کاملFormal Verification of Real time Software
The veri cation of functionality of the input output logic properties often composes the majority of software requirements analysis Automated theorem provers ATPs such as SRI s Prototype Veri cation System PVS have been successfully used in the formal veri cation of functional properties However such functional methods are not readily applicable to the veri cation of the real time software re q...
متن کامل